The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

0 CpxTRS
↳1 DecreasingLoopProof (⇔, 692 ms)
↳2 BOUNDS(n^1, INF)
↳3 RenamingProof (⇔, 0 ms)
↳4 CpxRelTRS
    ↳5 TypeInferenceProof (BOTH BOUNDS(ID, ID), 0 ms)
    ↳6 typed CpxTrs
    ↳7 OrderProof (LOWER BOUND(ID), 0 ms)
    ↳8 typed CpxTrs
    ↳9 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
    ↳10 typed CpxTrs
    ↳11 NoRewriteLemmaProof (LOWER BOUND(ID), 35 ms)
    ↳12 typed CpxTrs
    ↳13 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
    ↳14 typed CpxTrs
    ↳15 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
    ↳16 typed CpxTrs
    ↳17 NoRewriteLemmaProof (LOWER BOUND(ID), 0 ms)
    ↳18 typed CpxTrs
    ↳19 NoRewriteLemmaProof (LOWER BOUND(ID), 71 ms)
    ↳20 typed CpxTrs

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
f(mark(X)) →+ mark(f(X))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
The pumping substitution is [X / mark(X)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

S is empty.
Rewrite Strategy: FULL

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
active, g, h, f, proper, top

They will be analysed ascendingly in the following order:
g < active
h < active
f < active
active < top
g < proper
h < proper
f < proper
proper < top

(8) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

The following defined symbols remain to be analysed:
g, active, h, f, proper, top

They will be analysed ascendingly in the following order:
g < active
h < active
f < active
active < top
g < proper
h < proper
f < proper
proper < top

(9) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol g.

(10) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

The following defined symbols remain to be analysed:
h, active, f, proper, top

They will be analysed ascendingly in the following order:
h < active
f < active
active < top
h < proper
f < proper
proper < top

(11) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol h.

(12) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

The following defined symbols remain to be analysed:
f, active, proper, top

They will be analysed ascendingly in the following order:
f < active
active < top
f < proper
proper < top

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol f.

(14) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

The following defined symbols remain to be analysed:
active, proper, top

They will be analysed ascendingly in the following order:
active < top
proper < top

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol active.

(16) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

The following defined symbols remain to be analysed:
proper, top

They will be analysed ascendingly in the following order:
proper < top

(17) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol proper.

(18) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

The following defined symbols remain to be analysed:
top

(19) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol top.

(20) Obligation:

TRS:
Rules:
active(f(X)) → mark(g(h(f(X))))
active(f(X)) → f(active(X))
active(h(X)) → h(active(X))
f(mark(X)) → mark(f(X))
h(mark(X)) → mark(h(X))
proper(f(X)) → f(proper(X))
proper(g(X)) → g(proper(X))
proper(h(X)) → h(proper(X))
f(ok(X)) → ok(f(X))
g(ok(X)) → ok(g(X))
h(ok(X)) → ok(h(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Types:
active :: mark:ok → mark:ok
f :: mark:ok → mark:ok
mark :: mark:ok → mark:ok
g :: mark:ok → mark:ok
h :: mark:ok → mark:ok
proper :: mark:ok → mark:ok
ok :: mark:ok → mark:ok
top :: mark:ok → top
hole_mark:ok1_0 :: mark:ok
hole_top2_0 :: top
gen_mark:ok3_0 :: Nat → mark:ok

Generator Equations:
gen_mark:ok3_0(0) ⇔ hole_mark:ok1_0
gen_mark:ok3_0(+(x, 1)) ⇔ mark(gen_mark:ok3_0(x))

No more defined symbols left to analyse.